Solving Highly Constrained Search Problems with Quantum Computers
نویسندگان
چکیده
منابع مشابه
Solving Highly Constrained Search Problems with Quantum Computers
A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satissability problems for which the generalized algorithm can nd a solution in a constant number of steps as the number of variables increases. This performance contrasts with the lin...
متن کاملSolving Highly Constrained Search Problems with Quantum
A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satissability problems for which the generalized algorithm can nd a solution in a constant number of steps as the number of variables increases. This performance contrasts with the lin...
متن کاملSolving Random Satisfiability Problems with Quantum Computers
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average and variation of amplitudes among search states with the same costs. The analysis predicts good performance, on average, for a variety of problems including th...
متن کاملComputers in chess - solving inexact search problems
Preparing the books to read every day is enjoyable for many people. However, there are still many people who also don't like reading. This is a problem. But, when you can support others to start reading, it will be better. One of the books that can be recommended for new readers is computers in chess solving inexact search problems. This book is not kind of difficult book to read. It can be rea...
متن کاملQuantum Algorithms for Highly Structured Search Problems
We consider the problem of identifying a base k string given an oracle which returns information about the number of correct components in a query, specifically, the Hamming distance between the query and the solution, modulo r = max{2, 6 − k}. Classically this problem requires Ω(n logr k) queries. For k ∈ {2, 3, 4} we construct quantum algorithms requiring only a single quantum query. For k > ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1999
ISSN: 1076-9757
DOI: 10.1613/jair.574